An algorithm for rescaling a matrix positive definite
نویسندگان
چکیده
منابع مشابه
Active Positive-Definite Matrix Completion
In the FindCandidates function (line 4), Select finds all the single edges that can be added to the current mask graph GΩ while maintaining its chordal structure. To do that, we make use of the clique tree data structure as introduced by Ibarra [1]. Given a graph G = (V,E), the clique tree is a tree C = (VC , EC), in which each node is a maximal clique of G, i.e., VC ⊂ 2 . In our case the numbe...
متن کاملInteger Factorization of a Positive-Definite Matrix
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension of the matrix.
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملA fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...
متن کاملA Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite matrix. The algorithm is randomized and proceeds in two steps: first, it finds an approximation to the largest eigenvalue of the matrix after running a few iterations of the so-called “power method” from the numerical linear algebra literature. Then, using this information, it appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90340-5